Completion Time Minimization in Fog-RANs Using D2D Communications and Rate-Aware Network Coding

The device-to-device communication-aided fog radio access network, referred to as D2D-aided F-RAN, takes advantage of caching at enhanced remote heads (eRRHs) and D2D proximity for improved system performance. For D2D-aided we develop a framework that exploits the cached contents eRRHs, their transmission rates/powers, previously received by different users deliver requesting with minimum completion time. Given intractability time minimization problem, formulate it each approximating decoupling into two subproblems. In first subproblem, minimize possible in eRRH downlink transmissions, while second maximize number be scheduled on links. We design theoretical graphs, namely xmlns:xlink="http://www.w3.org/1999/xlink">interference-aware instantly decodable network coding (IA-IDNC) xmlns:xlink="http://www.w3.org/1999/xlink">D2D conflict graphs reformulate subproblems maximum weight clique independent set problems, respectively. Using these heuristically joint coordinated scheduling approaches. Simulation results show proposed approaches achieve considerable performance gain terms minimization.